Approximate Visibility for Illumination Computations using Point Clouds

نویسندگان

  • Philip Dutré
  • Parag Tole
  • Donald P. Greenberg
چکیده

In this paper, we present a simple technique to evaluate the visibility between pairs of points in a scene. In most current rendering algorithms, visibility queries are evaluated exactly. Our approach approximates the visibility value between two points using a point cloud representation of the surfaces in the scene. The computed value is a function of the distance and orientation of points in the point cloud relative to the line segment connecting the two query points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-Time Global Illumination in Point Clouds

In this paper we present a real-time global illumination approach for illuminating scenes containing huge point clouds. Our GI approach is based upon the distribution of Virtual Point Lights (VPLs) in the scene, which are then used for the indirect illumination of the scene geometry, using Imperfect Shadow Maps for visibility calculation of the VPLs. We are able to render multiple indirect ligh...

متن کامل

Real-time Indirect Illumination with Clustered Visibility

Visibility computation is often the bottleneck when rendering indirect illumination. However, recent methods based on instant radiosity have demonstrated that accurate visibility is not required for indirect illumination. To exploit this insight, we cluster a large number of virtual point lights – which represent the indirect illumination when using instant radiosity – into a small number of vi...

متن کامل

Visibility in Computer Graphics

Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms in computer graphics aimed to determine visible surfaces in a synthesized image of a 3D scene. Nowadays there are many different visibility algorithms for various visibility problems. We propose a new taxonomy of visibility problems that is based on a classification according to the ...

متن کامل

Fast Approximate Quantitative Visibility for Complex Scenes

Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantitative visibility queries, such as (i) what is the average visibility between a point (a differential area element) and a finite area or volume; or (ii) what is the average visibility between two finite areas or volumes....

متن کامل

Efficient From-Point Visibility for Global Illumination in Virtual Scenes with Participating Media

Visibility determination is one of the fundamental building blocks of photorealistic image synthesis. Light reflected at a shading point depends on light reflected from the visible scene surfaces and on the visible light sources in the environment. However, computing visibility is computational highly demanding and global illumination algorithms, such as final gathering and bias compensation fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000